Polytope volume in Normaliz
نویسندگان
چکیده
Abstract We survey the computation of polytope volumes by algorithms Normaliz to which Lawrence algorithm has recently been added. It enabled us master volume computations for polytopes from social choice in dimension 119. This challenge required a sophisticated implementation algorithm.
منابع مشابه
Recent Developments in Normaliz
The software Normaliz implements algorithms for rational cones and affine monoids. In this note we present recent developments. They include the support for (unbounded) polyhedra and semi-open cones. Furthermore, we report on improved algorithms and parallelization, which allow us to compute significantly larger examples.
متن کاملOn the Volume of a Certain Polytope
Let n ≥ 2 be an integer and consider the set Tn of n× n permutation matrices π for which πij = 0 for j ≥ i+ 2. In this paper we study the convex hull of Tn, which we denote by Pn. Pn is a polytope of dimension ( n 2 ) . Our main purpose is to provide evidence for the following conjecture concerning its volume. Let vn denote the minimum volume of a simplex with vertices in the affine lattice spa...
متن کاملThe asymptotic volume of the Birkhoff polytope
Let m,n ≥ 1 be integers. Define Tm,n to be the transportation polytope consisting of the m × n non-negative real matrices whose rows each sum to 1 and whose columns each sum to m/n. The special case Bn = Tn,n is the much-studied Birkhoffvon Neumann polytope of doubly-stochastic matrices. Using a recent asymptotic enumeration of non-negative integer matrices (Canfield and McKay, 2007), we determ...
متن کاملThe Boundary Volume of a Lattice Polytope
For a d-dimensional convex lattice polytope P , a formula for the boundary volume vol(∂P ) is derived in terms of the number of boundary lattice points on the first bd/2c dilations of P . As an application we give a necessary and sufficient condition for a polytope to be reflexive, and derive formulae for the f -vector of a smooth polytope in dimensions 3, 4, and 5. We also give applications to...
متن کاملPolytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in R, the objective is to minimize the number of vertices (alternatively, the number of facets) of an approximating polytope for a given Hausdorff error ε. Results to date have been of two types. The first type assumes that K is smooth, and bounds hold in the limit as ε tends ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The São Paulo Journal of Mathematical Sciences
سال: 2022
ISSN: ['2316-9028', '1982-6907']
DOI: https://doi.org/10.1007/s40863-022-00317-9